Optimum Information Queue Lengths in Semi-Batch Power Management Methods for a Palmtop Multimedia Terminal

نویسنده

  • Ying-Wen Bai
چکیده

In this paper, we propose a method for finding the optimum information queue length of a palmtop multimedia terminal. which is equipped with semi-batch power management. This optimum queue length is determined by the minimization of power consumption, which is based on the balance of the probability combination of high-power state and low-power state. The low-power states are derived from the “idle state” and the “waiting state” of the terminal operation model. The results show that the machine can have the potential to save 38.75% of the total power consumption when the utilization of the command queue is 50%, or when the probability of the “idle state” is 0.5. In addition, the machine can have a potential to save 70% of the total power consumption when the information queue length is adjusted to the optimum value, a three times of the queue length from the non-batching design by given parameters. However, the new design with this optimum information queue length will introduce an extra level of the latency to read the multimedia information from computer networks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fuzzy Based Approach for Rate Control in Wireless Multimedia Sensor Networks

Wireless Multimedia Sensor Networks (WMSNs) undergo congestion when a link (or a node) becomes overpopulated in terms of incoming packets. In WMSNs this happens especially in upstream nodes where all incoming packets meet and directed to the sink node. Congestion in networks, if not handled properly, might lead to congestion collapse which deteriorates the quality of service (QoS). Therefore, i...

متن کامل

The Bm Ap=g=1 Vacation Queue with Queue–length Dependent Vacation Schedule

We treat a single–server vacation queue with queue–length dependent vacation schedules. This subsumes the single–server vacation queue with exhaustive service discipline and the vacation queue with Bernoulli schedule as special cases. The lengths of vacation times depend on the number of customers in the system at the beginning of a vacation. The arrival process is a batch–Markovian arrival pro...

متن کامل

Analysis of a continuous time SM[K]/PH[K]/1/FCFS queue: Age process, sojourn times, and queue lengths

This paper studies a continuous time queueing system with multiple types of customers and a first-come-first-served service discipline. Customers arrive according to a semi-Markov arrival process and the service times of individual types of customers have PH -distributions. A GI /M /1 type Markov process for a generalized age process of batches of customers is constructed. The stationary distri...

متن کامل

Degradation of Terphetalic Acid from Petrochemical Wastewater by Ozonation and O3/ZnO Processes in Semi Batch Reactor

Background & Aims of the Study: One of the toxic pollutants in the wastewater of petrochemical industries is Terphetalic acid. In this study, the degradation and mineralization of Terphetalic acid in aqueous environment were studied by Ozonation and O3/ZnO processes in a semi batch reactor. Materials & Methods: This study is an experimental research on a laboratory scale. The st...

متن کامل

Cross Layer Architecture for Maintaining QoS in Multimedia Applications

Multimedia applications requires certain QoS to meet certain functionality.QoS requirements include bandwidth guarantees and temporal guarantees. In this paper, we propose a novel method that uses a cross layer architecture in which information from Application layer is used with UDPLite in Transport layer and Active Queue Management (AQM) with SiViRED in Network Layer with modified dynamic map...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001